Representation of Programming Constructs with the Kell-m Calculus
نویسندگان
چکیده
Kell-m is a new asynchronous, higher-order process calculus with localities, developed for modelling and verifying distributed event-based systems and applications. Although simple, due to the low level nature of kell-m, considerable effort is required when modelling complex systems. In this report we illustrate how common programming constructs such as variables, procedures, modules and lists can be represented using kellm. These constructs facilitate the modelling of systems and applications using kell-m.
منابع مشابه
The Kell Calculus: A Family of Higher-Order Distributed Process Calculi
This paper presents the Kell calculus, a family of distributed process calculi, parameterized by languages for input patterns, that is intended as a basis for studying component-based distributed programming. The Kell calculus is built around a π-calculus core, and follows five design principles which are essential for a foundational model of distributed and mobile programming: hierarchical loc...
متن کاملSemantics and Encoding of the kell-m Calculus
We present kell-m, an asynchronous higher-order process algebra with hierarchical localities. The main focus of this report is on the operational semantics and behavioural equivalences for kell-m. The operational semantics determine how systems represented using kell-m evolve; the behavioural equivalences determine what it means for two kell-m processes to behave similarly. We also present and ...
متن کاملModelling Distributed Event-Based Systems Using the kell-m Calculus
In this report we use the kell-m process algebra to develop three models for Distributed Event-Based Systems (DEBSs). The first model is of the DEBS API standard proposed by Pietzuch et al. The second model is for the hierarchical structuring mechanism for components in the REBECA DEBS. The third model is for the internal structure of administrative components in the NaradaBrokering DEBS. These...
متن کاملThe Kell Calculus: Operational Semantics and Type System
This paper presents the Kell calculus, a new distributed process calculus that retains the original insights of the Seal calculus (local actions, process replication) and of the M-calculus (higherorder processes and programmable membranes), although in a much simpler setting than the latter. The calculus is equipped with a type system that enforces a unicity property for location names that is ...
متن کاملShuffled Frog-Leaping Programming for Solving Regression Problems
There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...
متن کامل